Stochastic bounds for randomized load balancing
نویسندگان
چکیده
منابع مشابه
Load Balancing and Chernoff Bounds
This week, we consider a very simple load-balancing problem. Suppose you have n machines and m jobs. You want to assign the jobs to machines such that all machines have approximately the same load. Of course, there is a solution with load at most dmn e on every machine, but that requires central coordination. Without central coordination, the easiest thing you can do is let each job drawn one m...
متن کاملRandomized Load Balancing on Networks with Stochastic Inputs
Iterative load balancing algorithms for indivisible tokens have been studied intensively in the past, e.g., [22, 19, 25]. Complementing previous worst-case analyses, we study an average-case scenario where the load inputs are drawn from a fixed probability distribution. For cycles, tori, hypercubes and expanders, we obtain almost matching upper and lower bounds on the discrepancy, the differenc...
متن کاملParallel randomized load balancing
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds Θ(logn/ log logn) balls with high probability. More recently, Azar et al. analyzed the following process: randomly choose d bins for each ball, and then place the balls, one by one, into the least full bin from its d choices [2]. They show that after all n balls have been placed,...
متن کاملStochastic Load Balancing and Related Problems
We study the problems of makespan minimization (load balancing), knapsack, and bin packing when the jobs have stochastic processing requirements or sizes. If the jobs are all Poisson, we present a two approximation for the first problem using Graham’s rule, and observe that polynomial time approximation schemes can be obtained for the last two problems. If the jobs are all exponential, we prese...
متن کاملRandomized load balancing in heavy tra c
We consider three randomized schemes for load balancing among a xed number, N , of resources, and analyze them in the heavy tra c limit. The rst is join the shortest queue, where arrivals are routed to the shortest among d randomly chosen queues, where d ∈ {2, . . . , N}. The second is redundancy routing, where jobs are replicated d times, routed simultaneously to d randomly chosen queues, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2012
ISSN: 0163-5999
DOI: 10.1145/2425248.2425267